Fully Dynamic 3-Dimensional Orthogonal Graph Drawing
نویسندگان
چکیده
منابع مشابه
Fully Dynamic 3-Dimensional Orthogonal Graph Drawing
In a 3-dimensional orthogonal drawing of a graph, vertices are mapped to grid points on a 3-dimensional rectangular integer lattice and edges are routed along integer grid lines. In this paper, we present a technique that produces a 3D orthogonal drawing of any graph with n vertices of degree 6 or less, using at most 6 bends per edge route and in a volume bounded by O(n). The advantage of our s...
متن کاملThree-dimensional orthogonal graph drawing algorithms
We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. The best previous result generated a drawing bounded by an O( √ n) × O( √ n) × O( √ n) box, with each edge route containing up to 16 bends. Our algorithms initiate the study of bend=bounding box trade-o issues for thre...
متن کاملBounds for Orthogonal 3-D Graph Drawing
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn, with vertices drawn as boxes. It establishes asymptotic lower bounds for the volume of the bounding box and the number of bends of such drawings and exhibits a construction that achieves these bounds. No edge route in this construction bends more than three times. For drawings constrained to have a...
متن کاملInteractive Orthogonal Graph Drawing
Many applications require human interaction during the design process. The user is given the ability to alter the graph as the design progresses. Interactive Graph Drawing allows the user to dynamically interact with the drawing. In this paper we discuss features that are essential for an interactive orthogonal graph drawing system. We also describe some possible interactive drawing scenaria, p...
متن کامل6. Orthogonal Graph Drawing
There are various criteria to judge the quality of a drawing of a graph. From a human point of view, one of the most important issues is the readability of a drawing: ideally, it should be easy to understand the structure of a graph with just a few glances, and the chance of confusion over connections between different vertices should be small. From an algorithmic point of view, it is necessary...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2001
ISSN: 1526-1719
DOI: 10.7155/jgaa.00033